Minimum-autocorrelation sequences

Binary sequences with optimal autocorrelation

Low autocorrelation binary sequences: Number theory-based analysis for minimum energy level, Barker codes

Low autocorrelation binary sequences (LABS) are very important for communication applications. And it is a notoriously difficult computational problem to find binary sequences with low aperiodic autocorrelations. The problem can also be stated in terms of finding binary sequences with minimum energy levels or maximum merit factor defined by M.J.E. Golay, E N F 2 2 = , N and E being the sequence...

New Quaternary Sequences with Ideal Autocorrelation Constructed from Legendre Sequences

In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal autocorrelation property are constructed using the binary Legendre sequences of period p. For the new quaternary sequences, two properties which are considered as the major characteristics of pseudo-random sequences are derived. Firstly, the autocorrelation distribution of the proposed quaternary sequences ...

Convex optimization problems involving finite autocorrelation sequences

We discuss convex optimization problems where some of the variables are constrained to be finite autocorrelation sequences. Problems of this form arise in signal processing and communications, and we describe applications in filter design and system identification. Autocorrelation constraints in optimization problems are often approximated by sampling the corresponding power spectral density, w...

A Construction for Perfect Periodic Autocorrelation Sequences

There exists a number of known constructions for perfect sequences over roots of unity. These include Frank sequences of length n over n roots of unity [Heimiller, 1961][Frank, 1962], Chu sequences of length n over n roots of unity for n odd and length n over 2n roots of unity for n even [Chu, 1972], Milewski sequences of length m overm roots of unity [Milewski, 1983], Liu-Fan sequences of leng...